Deductive Translation Validation for a Subset of Higher Order Logic

نویسندگان

  • Guodong Li
  • Konrad Slind
چکیده

We discuss a proof-producing compiler for a subset of higher order logic. The translation validation is automatic, and is based on Hoare rules derived from a compositional semantics for sequences of instructions for an ARM-like machine. Partial and total correctness are dealt with. The main focus is on issues in the intermediate level and back-end of the compiler.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Proof-Producing Software Compiler for a Subset of Higher Order Logic

We discuss a proof-producing compiler which translates first order recursion equations, defined in higher order logic, to assembly language. The front end of the compiler is based on a series of source-tosource translations, starting with a semantic CPS translation and culminating in graph-colouring register allocation. Equality of the original program and the result of register allocation is p...

متن کامل

De ning and Translating Visual Schemas for Deductive Databases

We present a visual language expressive enough to capture an important subset of First Order Predicate Logic as well as its straightforward translation to the logic-based paradigm of deductive databases. We use the diagrams of our language to represent all the components of a deductive database schema: base predicates, derived predicates with their deductive rules, and integrity constraints. Ou...

متن کامل

De ning and Translating Visual Schemas for Deductive

We present a visual language expressive enough to capture an important subset of First Order Predicate Logic as well as its straightforward translation to the logic-based paradigm of deductive databases. We use the diagrams of our language to represent all the components of a deductive database schema: base predicates, derived predicates with their deductive rules, and integrity constraints. Ou...

متن کامل

Structure of a Proof-Producing Compiler for a Subset of Higher Order Logic

We give an overview of a proof-producing compiler which translates recursion equations, defined in higher order logic, to assembly language. The compiler is implemented and validated with a mix of translation validation and compiler verification techniques. Both the design of the compiler and its mechanical verification are implemented in the same logic framework.

متن کامل

A Linear Logic Speci cation for

Forum 36], a powerful logic formalism based on Higher Order Linear Logic, is particularly suited to specify and reason about complex programs and systems. Ehhf12], a subset of Forum, models many interesting logic programming extensions towards O.O. and concurrent systems and can be viewed as a very high level logic programming speciication language. The paper presents some results in this direc...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011